On Farthest-Point Information in Networks
نویسندگان
چکیده
Consider the continuum of points along the edges of a network, an embedded undirected graph with positive edge weights. Distance between these points can be measured as shortest path distance along the edges of the network. We introduce two new concepts to capture farthest-point information in this metric space. The first, eccentricity diagrams, are used to encode the distance towards farthest points for any point on the network compactly. With this, we can solve the minimum eccentricity feed-link problem, i.e., the problem to extend a network by one new point minimizing the largest network distance towards the new point. The second, network farthest-point diagrams, provide an implicit description of the sets of farthest points. A network farthest-point diagram is, in principle, a compressed farthest-point network Voronoi link diagram generated by the entire continuum of uncountably many points on the network at hand. We provide construction algorithms for data structures that allow for queries for the distance to farthest points as well as their location from any point on a network in optimal time. Thus, we establish first bounds on construction times and storage requirements of such data structures.
منابع مشابه
SOME NEW RESULTS ON REMOTEST POINTS IN NORMED SPACES
In this paper, using the best proximity theorems for an extensionof Brosowski's theorem. We obtain other results on farthest points. Finally, wedene the concept of e- farthest points. We shall prove interesting relationshipbetween the -best approximation and the e-farthest points in normed linearspaces (X; ||.||). If z in W is a e-farthest point from an x in X, then z is also a-best approximati...
متن کاملw_0-Nearest Points and w_0-Farthest Point in Normed Linear Spaces
w0-Nearest Points and w0-Farthest Point in Normed Linear Spaces
متن کاملOptimal Data Structures for Farthest-Point Queries in Cactus Networks
Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce optimal data structures supporting queries for the farthest di...
متن کاملEfficient Farthest-Point Queries in Two-terminal Series-parallel Networks
Consider the continuum of points along the edges of a network, i.e., a connected, undirected graph with positive edge weights. We measure the distance between these points in terms of the weighted shortest path distance, called the network distance. Within this metric space, we study farthest points and farthest distances. We introduce a data structure supporting queries for the farthest distan...
متن کاملOptimal Data Structures for Farthest-Point
6 Consider the continuum of points on the edges of a network, i.e., a connected, undirected graph 7 with positive edge weights. We measure the distance between these points in terms of the weighted 8 shortest path distance, called the network distance. Within this metric space, we study farthest points 9 and farthest distances. We introduce optimal data structures supporting queries for the far...
متن کامل